Recursion Interview Questions [closed]
Posted
by halivingston
on Stack Overflow
See other posts from Stack Overflow
or by halivingston
Published on 2010-05-05T06:00:28Z
Indexed on
2010/05/05
6:08 UTC
Read the original article
Hit count: 229
Given a string, "ABC", print all permutations
Given a dollar bill, fill out possible ways it can summed up using .25, .10, .5, etc.
Given a phone number (123-456), print out all it's word counter parters like (ADG-XYZ)
A B C D
E F G H
I J K L
M N O P
In the above 2D matrix, print all possible words (just literally all words, and sure we could check if it's exists in a dictionary). The base case is I think here is that reaching the same i, j positions.
Any others you can think of?
© Stack Overflow or respective owner
